General Acyclicity and Cyclicity Notions for the Disjunctive Skolem Chase
نویسندگان
چکیده
The disjunctive skolem chase is a sound, complete, and potentially non-terminating procedure for solving boolean conjunctive query entailment over knowledge bases of existential rules. We develop novel acyclicity cyclicity notions this procedure; that is, we sufficient conditions to determine termination non-termination. Our empirical evaluation shows our are significantly more general than existing criteria.
منابع مشابه
Tractable Query Answering for Expressive Ontologies and Existential Rules
The disjunctive skolem chase is a sound and complete (albeit non-terminating) algorithm that can be used to solve conjunctive query answering over DL ontologies and programs with disjunctive existential rules. Even though acyclicity notions can be used to ensure chase termination for a large subset of real-world knowledge bases, the complexity of reasoning over acyclic theories still remains hi...
متن کاملRestricted Chase (Non)Termination for Existential Rules with Disjunctions
The restricted chase is a sound and complete algorithm for conjunctive query answering over ontologies of disjunctive existential rules. We develop acyclicity conditions to ensure its termination. Our criteria cannot always detect termination (the problem is undecidable), and we develop the first cyclicity criteria to show non-termination of the restricted chase. Experiments on real-world ontol...
متن کاملBeyond Skolem Chase: A Study of Finite Chase under Standard Chase Variant
The chase procedure is an indispensable tool for several database applications, where its termination guarantees decidability of these tasks. Most previous studies have focused on the skolem chase variant and its termination. It is known that the standard chase variant is more powerful in termination analysis provided a database is given. But all-instance termination analysis presents a challen...
متن کاملExtending Acyclicity Notions for Existential Rules (\emph{long version})
Existential rules have been proposed for representing on-tological knowledge, specifically in the context of Ontology-BasedQuery Answering. Entailment with existential rules is undecidable.We focus in this paper on conditions that ensure the terminationof a breadth-first forward chaining algorithm known as the chase.First, we propose a new tool that allows to extend existing...
متن کاملthe search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2023
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v37i5.25784